#!/usr/bin/env python3
# -*- coding: utf-8 -*-

from load import load_main
from search import *

class Randomized_MaxValueProblem(Problem):
    
    def __init__(self, percepts):
        "Constructor of Randomized_MaxValueProblem"
        self.initial = Randomized_MaxValueState(percepts)
    
    def successor(self, state):
        "It yields a new possible state from given one"
        pass
    
    def value(self,state):
        "Yields the value "
        return state.value()
    
class Randomized_MaxValueState():
    
    def __init__(self, percepts):
        self.tsp_map = percepts

    def __str__(self):
        pass
    
    def value(self):
        pass

    
if __name__ == "__main__":
    percepts = load_main()
    
    # Launching the search algorithms
    problem = Randomized_MaxValueProblem(percepts)
    #node = random_walk(problem)
    #node = breadth_first_graph_search(problem)
    #path = node.path()
    #path.reverse()
